Some Positive Results for Boundedness of Multiple Recursive Rules
نویسنده
چکیده
Following results are sketched in this extended abstract Datalog recursive programs where each rule has at most one subgoal called unit recursions are shown to be bounded with an e ective con struction of equivalent non recursive programs A generalized chain program which allow IDB predicates of arbitrary arity and remove the uniqueness condition of chain variables is bounded if and only if it is a unit recursion The characterization of uniform unboundedness for linear sirups in NS is extended to a substantial superclass called class C Boundedness for class C with multiple exit rules is decidable in polynomial space Predicate boundedness is decidable in doubly exponential time for a large class of Datalog programs that properly con tains all connected monadic programs For binary linear programs program boundedness is decidable if each recursive predicate is de ned by at most one recursive rule predicate boundedness is also decidable if each recursive predicate is mutually recursive with one another
منابع مشابه
Predicting Implantation Outcome of In Vitro Fertilization and Intracytoplasmic Sperm Injection Using Data Mining Techniques
Objective The main purpose of this article is to choose the best predictive model for IVF/ICSI classification and to calculate the probability of IVF/ICSI success for each couple using Artificial intelligence. Also, we aimed to find the most effective factors for prediction of ART success in infertile couples. MaterialsAndMethods In this cross-sectional study, the data of 486 patients are colle...
متن کاملBoundedness character of positive solutions of a higher order difference equation
Recently there has been a great deal of interest in studying the behaviour of rational difference equations. One of the properties which has attracted considerable attention from the experts in the research field is the boundedness character (see, e.g. [1–32] and the related references therein). This paper studies the boundedness character of positive solutions of the recursive equation yn = A+...
متن کاملBounded Implication for Existential Rules (Extended Abstract)
The problem This paper deals with the property of boundedness in rule languages. Boundedness is an important notion that formalizes the fact that a rule set Σ can be unfolded into a finite set Σ of acyclic (i.e., non-recursive) rules such that Σ and Σ are equivalent on every database: it is therefore a crucial property for optimizing the processing of rules. Such a property has been extensively...
متن کاملSome functional inequalities in variable exponent spaces with a more generalization of uniform continuity condition
Some functional inequalities in variable exponent Lebesgue spaces are presented. The bi-weighted modular inequality with variable exponent $p(.)$ for the Hardy operator restricted to non- increasing function which is$$int_0^infty (frac{1}{x}int_0^x f(t)dt)^{p(x)}v(x)dxleqCint_0^infty f(x)^{p(x)}u(x)dx,$$ is studied. We show that the exponent $p(.)$ for which these modular ine...
متن کامل